Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph
نویسندگان
چکیده
منابع مشابه
Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph
We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in R2 of intensities λ and λE respectively. A directed edge from one legitimate node A to another legitimate node B exists provided the strength of the signal transmitted from node A that is received at node B i...
متن کاملPercolation in the Signal to Interference Ratio Graph
Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range of each other have been extensively studied. This paper considers a variation in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other points of the point process. This model has been rec...
متن کاملInformation Theoretically Secure Databases
We introduce the notion of a database system that is information theoretically secure in between accesses—a database system with the properties that 1) users can efficiently access their data, and 2) while a user is not accessing their data, the user’s information is information theoretically secure to malicious agents, provided that certain requirements on the maintenance of the database are r...
متن کاملInformation-Theoretically Secure Byzantine Paxos
We present Information Theoretically secure Byzantine Paxos (IT ByzPaxos), the first deterministic asynchronous Byzantine consensus protocol that is provably secure despite a computationally unbounded adversary. Previous deterministic asynchronous algorithms for Byzantine consensus rely on unproven number theoretic assumptions (i.e., digital signatures) to maintain agreement. IT ByzPaxos instea...
متن کاملInformation-theoretically Secure Strong Verifiable Secret Sharing
In a (t,n) secret sharing scheme, a mutually trusted dealer divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. When there is no mutually trusted dealer, a (n,t,n) secret sharing scheme can be used to set up a (t,n) secret sharing because each shareholder also acts as a dealer to decide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2014
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200011876